Triangle-Free Planar Graphs and Segment Intersection Graphs
نویسندگان
چکیده
منابع مشابه
Triangle-Free Planar Graphs and Segment Intersection Graphs
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a way that no two segments cross, i.e., intersect in a common
متن کاملOriented colorings of triangle-free planar graphs
Oriented graphs are directed graphs without opposite arcs. In other words an oriented graph is an orientation of an undirected graph, obtained by assigning to every edge one of the two possible orientations. IfG is a graph, V (G) denotes its vertex set, E(G) denotes its set of edges (or arcs if G is an oriented graph) and F (G) denotes its set of faces if G is planar. A homomorphism from an ori...
متن کاملFractional Coloring of Triangle-Free Planar Graphs
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 .
متن کاملIntersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar graphs. Our algorithm uses a combination of different techniques to achieve smooth transformations: rigid morphing, compatible triangulations, as well as morphing based on interpolation of the convex repr...
متن کاملMedian Graphs and Triangle-Free Graphs
Let M(m,n) be the complexity of checking whether a graph G with m edges and n vertices is a median graph. We show that the complexity of checking whether G is triangle-free is at most M(m,m). Conversely, we prove that the complexity of checking whether a given graph is a median graph is at most O(m log n) + T (m log n, n), where T (m,n) is the complexity of finding all triangles of the graph. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2002
ISSN: 1526-1719
DOI: 10.7155/jgaa.00043